Theoretically and Computationally Convenient Geometries on Full-Rank Correlation Matrices

نویسندگان

چکیده

In contrast to SPD matrices, few tools exist perform Riemannian statistics on the open elliptope of full-rank correlation matrices. The quotient-affine metric was recently built as quotient affine-invariant by congruence action positive diagonal space matrices had always been thought a homogeneous space. contrast, we view in this work Lie group and left-invariant metric. This unexpected new viewpoint allows us generalize construction show that main operations can be computed numerically. However, uniqueness logarithm or Fréchet mean are not ensured, which is bad for computing elliptope. Hence, define three families metrics provide Hadamard structures, including two flat. Thus unique. (flat) vector structures particularly appealing because they reduce manifold We also nilpotent structure affine Riemannian/group these four closed form.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Correlation Clustering with Low-Rank Matrices

Correlation clustering is a technique for aggregating data based on qualitative information about which pairs of objects are labeled ‘similar’ or ‘dissimilar.’ Because the optimization problem is NP-hard, much of the previous literature focuses on finding approximation algorithms. In this paper we explore how to solve the correlation clustering objective exactly when the data to be clustered ca...

متن کامل

On higher rank numerical hulls of normal matrices

‎In this paper‎, ‎some algebraic and geometrical properties of the rank$-k$ numerical hulls of normal matrices are investigated‎. ‎A characterization of normal matrices whose rank$-1$ numerical hulls are equal to their numerical range is given‎. ‎Moreover‎, ‎using the extreme points of the numerical range‎, ‎the higher rank numerical hulls of matrices of the form $A_1 oplus i A_2$‎, ‎where $A_1...

متن کامل

Geometries on σ-Hermitian matrices

Ring geometry and the geometry of matrices meet naturally at the ring R := Kn×n of n× n matrices with entries in a (not necessarily commutative) field K. Our aim is to strengthen the interaction between these disciplines. Below we sketch some results from either side, even though not in their most general form, but in a way which is tailored for our needs. Let us start with ring geometry, where...

متن کامل

Color Texture Classification under Different Illuminations Using Rank Correlation Matrices

Color has been shown to be useful in the context of texture classification. However, since under different illuminations color is not stable, color invariant descriptors should be defined when the illumination of the query is unknown. In this paper, we propose to characterize color textures by analyzing the rank correlation of color planes between pixels locally close to each other. Thus, consi...

متن کامل

Rank-based Tapering Estimation of Bandable Correlation Matrices

The nonparanormal model assumes that variables follow a multivariate normal distribution after a set of unknown monotone increasing transformations. It is a flexible generalization of the normal model but retains the nice interpretability of the latter. In this paper we propose a rank-based tapering estimator for estimating the correlation matrix in the nonparanormal model in which the variable...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Matrix Analysis and Applications

سال: 2022

ISSN: ['1095-7162', '0895-4798']

DOI: https://doi.org/10.1137/22m1471729